An Improved Convergent Iterative Method for Finding the Moore- Penrose Inverse

نویسندگان

  • Ashim Kumar
  • Vinay Kanwar
چکیده

The goal of this paper is to suggest and establish an efficient iterative method based on matrix by matrix multiplications for finding the approximate inverse of nonsingular square matrices. We then analytically extend this proposed method so as to compute the Moore-Penrose generalized inverse of a non-square matrix. A theoretical analysis has been employed to compare the computational efficiency of the presented scheme with the other existing methods in the literature to show that it is economic. Numerical experiments are also executed to manifest its superiority.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse

A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.

متن کامل

An accelerated iterative method for computing weighted Moore-Penrose inverse

The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...

متن کامل

An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix

In this paper, an iterative scheme is proposed to find the roots of a nonlinear equation. It is shown that this iterative method has fourth order convergence in the neighborhood of the root. Based on this iterative scheme, we propose the main contribution of this paper as a new high-order computational algorithm for finding an approximate inverse of a square matrix. The analytical discussions s...

متن کامل

Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations

An iterative algorithm for estimating the Moore-Penrose generalized inverse is developed. The main motive for the construction of algorithm is simultaneous usage of Penrose equations (2) and (4). Convergence properties of the introduced method are considered as well as their first-order and the second-order error terms. Numerical experience is also presented. AMS Subj. Class.: 15A09.

متن کامل

Monotonicity and Iterative Approximations Involving Rectangular Matrices

A new characterization of row-monotone matrices is given and is related to the Moore-Penrose generalized inverse. The M-matrix concept is extended to rectangular matrices with full column rank. A structure theorem is provided for all matrices A with full column rank for which the generalized inverse A+ & 0. These results are then used to investigate convergent splittings of rectangular matrices...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015